On the Lebesgue constant for Lagrange interpolation on equidistant nodes
نویسندگان
چکیده
Properties of the Lebesgue function for Lagrange interpolation on equidistant nodes are investigated. It is proved that the Lebesgue function can be formulated both in terms of a hypergeometric function 2F1 and Jacobi polynomials. Moreover an integral expression of the Lebesgue function is also obtained. Finally, the asymptotic behavior of the Lebesgue constant is studied.
منابع مشابه
Barycentric rational interpolation at quasi-equidistant nodes
A collection of recent papers reveals that linear barycentric rational interpolation with the weights suggested by Floater and Hormann is a good choice for approximating smooth functions, especially when the interpolation nodes are equidistant. In the latter setting, the Lebesgue constant of this rational interpolation process is known to grow only logarithmically with the number of nodes. But ...
متن کاملA tighter upper bound on the Lebesgue constant of Berrut's rational interpolant at equidistant nodes
It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results show tha...
متن کاملOn the Lebesgue constant of barycentric rational interpolation at equidistant nodes
Recent results reveal that the family of barycentric rational interpolants introduced by Floater and Hormann is very well-suited for the approximation of functions as well as their derivatives, integrals and primitives. Especially in the case of equidistant interpolation nodes, these infinitely smooth interpolants offer a much better choice than their polynomial analogue. A natural and importan...
متن کاملLebesgue constants in polynomial interpolation
Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...
متن کاملBounding the Lebesgue constant for Berrut's rational interpolant at general nodes
It has recently been shown that the Lebesgue constant for Berrut’s rational interpolant at equidistant nodes grows logarithmically in the number of interpolation nodes. In this paper we show that the same holds for a very general class of well-spaced nodes and essentially any distribution of nodes that satisfy a certain regularity condition, including Chebyshev–Gauss–Lobatto nodes as well as ex...
متن کامل